A two-stage hybrid flow shop problem with dedicated machine and release date
نویسندگان
چکیده
منابع مشابه
A Two-stage Flow Shop with Parallel Dedicated Machines
The paper considers the 2-stage flow shop problem with parallel dedicated machines. In such a situation, each job can only be processed on a pre specified subset of machines. A mathematical model for this problem is proposed to minimize the maximum completion time among all jobs commonly known as the makespan or the Cmax. Furthermore, two approximate methods are proposed. The first one is a heu...
متن کاملA case study in a two-stage hybrid flow shop with setup time and dedicated machines
In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day’s mix of label stickers through the shop such that the weighted maximal tardiness is minim...
متن کاملMakespan minimization for two-stage hybrid Flow shop with dedicated machines and additional constraints
This paper considers a two-stage hybrid flow shop scheduling problem. The objective is the minimizing of maximum completion time of all the jobs. There exist two dedicated machines at stage 1 and one machine at stage 2. Each job is defined by two operations processed on the two-stages in series. Depending on the job type, the job is processed on either of the two machines at stage1 and must be ...
متن کاملInverse scheduling: two-machine flow-shop problem
We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...
متن کاملCyclic Hybrid Flow-shop Scheduling Problem with Machine Setups
In this paper we consider an NP -hard hybrid flow shop problem with machine setups and cycletime minimization. The above issue is an important generalization of a flow-shop problem with minimization of a cycle time, and it stays in a direct relationship with a flexible job shop problem. In the hybrid problem task operations are performed by machines arranged in slots, i.e., a set of machines wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.07.235